Weighted Burrows–Wheeler Compression

Weighted universal image compression

We describe a general coding strategy leading to a family of universal image compression systems designed to give good performance in applications where the statistics of the source to be compressed are not available at design time or vary over time or space. The basic approach considered uses a two-stage structure in which the single source code of traditional image compression systems is repl...

Spectral compression: Weighted principal component analysis versus weighted least squares

Two weighted compression schemes, Weighted Least Squares (wLS) and Weighted Principal Component Analysis (wPCA), are compared by considering their performance in minimizing both spectral and colorimetric errors of reconstructed reflectance spectra. A comparison is also made among seven different weighting functions incorporated into ordinary PCA/LS to give selectively more importance to the wav...

Generalized Weighted Finite Automata Based Image Compression

Aritmetic Compression of Weighted Finite Automata

Karel Culik and the first author have demonstrated how Weighted Finite Automata (WFA) provide a strong tool for image compression [1, 2, 3, 4]. In the present article we introduce an improved method for the last step of the compression algorithm: for compressing the WFA that approximates the given image. Our method is based on arithmetic compression of sparse matrices.

Scalable Compression of a Weighted Graph

Graph is a useful data structure to model various real life aspects like email communications, coauthorship among researchers, interactions among chemical compounds, and so on. Supporting such real life interactions produce a knowledge rich massive repository of data. However, efficiently understanding underlying trends and patterns is hard due to large size of the graph. Therefore, this paper ...